The generalized Fibonomial matrix
نویسندگان
چکیده
منابع مشابه
The generalized Fibonomial matrix
The Fibonomial coe¢ cients are known as interesting generalization of binomial coe¢ cients. In this paper, we derive a (k + 1)th recurrence relation and generating matrix for the Fibonomial coe¢ cients, which we call generalized Fibonomial matrix. We nd a nice relationship between the eigenvalues of the Fibonomial matrix and the generalized right-adjusted Pascal matrix that they have the same ...
متن کاملGeneralized Fibonacci polynomials and Fibonomial coefficients
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s, t given by {0} = 0, {1} = 1, and {n} = s{n−1}+t{n−2} for n ≥ 2. The latter are defined by { n k } = {n}!/({k}!{n−k}!) where {n}! = {1}{2} . . . {n}. These quotients are also polynomials in s, t and specializations give the ordinary binomial coeffi...
متن کاملThe Generalized Pascal Matrix via the Generalized Fibonacci Matrix and the Generalized Pell Matrix
In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملThe generalized Lilbert matrix
We introduce a generalized Lilbert [Lucas-Hilbert] matrix. Explicit formulæ are derived for the LU-decomposition and their inverses, as well as the Cholesky decomposition. The approach is to use q-analysis and to leave the justification of the necessary identities to the q-version of Zeilberger’s celebrated algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.03.041